Fair cost-sharing methods for the minimum spanning tree game
نویسندگان
چکیده
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملA fair rule in minimum cost spanning tree problems Gustavo Bergantiños and Juan J . Vidal - Puga 06 - 05
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.
متن کاملOn the core of cost-revenue games: Minimum cost spanning tree games with revenues
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the agents using the general service, the value of a coalition is defined as the maximum net profit that...
متن کاملA fair rule in minimum cost spanning tree problems
We study minimum cost spanning tree problems and de ne a cost sharing rule that satis es many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties. Keywords: Spanning tree. Cost allocation. Monotonicity. JEL Classi cation Numbers: C71, D63, D7.
متن کاملGroup Strategyproofness and No Subsidy via LP-Duality
We make two contributions to cooperative game theory, both of which rely heavily on linear programming duality theory. First, we introduce a fairness criterion on service providers, which we call No Subsidy. This condition ensures that a subset of the users is not overcharged in order to subsidize another set of users. We completely characterize cost functions that allow cost sharing mechanisms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 100 شماره
صفحات -
تاریخ انتشار 2006